Nonconvex piecewise linear knapsack problems
نویسندگان
چکیده
This paper considers the minimization version of a class of nonconvex knapsack problems with piecewise linear cost structure. The items to be included in the knapsack have a divisible quantity and a cost function. An item can be included partially in the given quantity range and the cost is a nonconvex piecewise linear function of quantity. Given a demand, the optimization problem is to choose an optimal quantity for each item such that the demand is satisfied and the total cost is minimized. This problem and its close variants are encountered in manufacturing planning, supply chain design, volume discount procurement auctions, and many other contemporary applications. Two separate mixed integer linear programming formulations of this problem are proposed and are compared with existing formulations. Motivated by different scenarios in which the problem is useful, the following algorithms are developed: (1) a fast polynomial time, near-optimal heuristic using convex envelopes; (2) exact pseudo-polynomial time dynamic programming algorithms; (3) a 2-approximation algorithm; and (4) a fully polynomial time approximation scheme. A comprehensive test suite is developed to generate representative problem instances with different characteristics. Extensive computational experiments show that the proposed formulations and algorithms are faster than the existing techniques. 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Error Estimates for the Finite Volume Element Method for Elliptic Pde’s in Nonconvex Polygonal Domains
We consider standard finite volume piecewise linear approximations for second order elliptic boundary value problems on a nonconvex polygonal domain. Based on sharp shift estimates, we derive error estimations in H –, L2– and L∞–norm, taking into consideration the regularity of the data. Numerical experiments and counterexamples illustrate the theoretical results.
متن کاملNonconvex Piecewise-Quadratic Underestimation for Global Minimization
Motivated by the fact that important real-life problems, such as the protein docking problem, can be accurately modeled by minimizing a nonconvex piecewise-quadratic function, a nonconvex underestimator is constructed as the minimum of a finite number of strictly convex quadratic functions. The nonconvex underestimator is generated by minimizing a linear function on a reverse convex region and ...
متن کاملThe Reformulation-based αGO Algorithm for Solving Nonconvex MINLP Problems – Some Improvements
The α-reformulation (αR) technique can be used to transform any nonconvex twice-differentiable mixedinteger nonlinear programming problem to a convex relaxed form. By adding a quadratic function to the nonconvex function it is possible to convexify it, and by subtracting a piecewise linearization of the added function a convex underestimator will be obtained. This reformulation technique is imp...
متن کاملA global optimization method for nonconvex separable programming problems
Conventional methods of solving nonconvex separable programming (NSP) problems by mixed integer programming methods requires adding numerous 0±1 variables. In this work, we present a new method of deriving the global optimum of a NSP program using less number of 0±1 variables. A separable function is initially expressed by a piecewise linear function with summation of absolute terms. Linearizin...
متن کاملError Estimates for a Finite Volume Element Method for Elliptic PDEs in Nonconvex Polygonal Domains
We consider standard finite volume piecewise linear approximations for second order elliptic boundary value problems on a nonconvex polygonal domain. Based on sharp shift estimates, we derive error estimations in H1-, L2and L∞-norms, taking into consideration the regularity of the data. Numerical experiments and counterexamples illustrate the theoretical results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 192 شماره
صفحات -
تاریخ انتشار 2009